________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:25:54
Input Data from:  dataset122.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,1425
Average f[i]   :3800
Average g[i,j] :1990,47619047619
Total demand   :11130
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 29
> Selected Move:	2830	1	-1	3	6000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0    >new incumb.: 2830


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 30
> Selected Move:	3910	1	-1	6	11000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0    >new incumb.: 3910


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 37
> Selected Move:	4960	1	-1	5	17000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  0    >new incumb.: 4960


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 37
> Selected Move:	5590	3	2	8	18900


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  4  0    >new incumb.: 5590


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 27
> Selected Move:	5590	4	8	3	17000


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 27
> Selected Move:	5590	4	3	5	16800


> New Y[]: 
	
	 2  3  0  1  0  4  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 26
> Selected Move:	5590	4	5	6	18000


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 31
> Selected Move:	5110	3	3	9	17500


> New Y[]: 
	
	 2  3  0  0  0  1  4  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 33
> Selected Move:	5110	4	6	5	16300


> New Y[]: 
	
	 2  3  0  0  0  4  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 32
> Selected Move:	5110	4	5	8	18400


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 29
> Selected Move:	5110	4	8	9	17200


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 31
> Selected Move:	5100	3	8	3	19200


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 29
> Selected Move:	5100	4	9	3	18500


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 30
> Selected Move:	5100	4	3	5	18300


> New Y[]: 
	
	 2  3  0  1  0  4  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 29
> Selected Move:	5100	4	5	6	19500


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 29
> Selected Move:	4990	3	9	7	19000


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 30
> Selected Move:	4990	4	6	3	18000


> New Y[]: 
	
	 2  3  0  4  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 30
> Selected Move:	4990	4	3	5	17800


> New Y[]: 
	
	 2  3  0  1  0  4  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 29
> Selected Move:	4990	4	5	7	18800


> New Y[]: 
	
	 2  3  0  1  0  1  1  4  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 28
> Selected Move:	4670	3	3	9	18300


> New Y[]: 
	
	 2  3  0  0  0  1  1  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 31
> Selected Move:	4760	3	7	2	16500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 32
> Selected Move:	5240	3	1	3	18800


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 29
> Selected Move:	5280	3	9	8	17300


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 30
> Selected Move:	5280	4	3	5	17500


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 31
> Selected Move:	5280	4	5	6	17600


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 30
> Selected Move:	5280	4	6	8	19300


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 28
> Selected Move:	5240	3	8	9	18600


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 28
> Selected Move:	5240	4	9	5	19000


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 28
> Selected Move:	5240	4	5	6	19100


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 31
> Selected Move:	4760	3	6	1	17500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 37
> Selected Move:	4890	1	-1	6	22500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 25
> Selected Move:	5495	3	9	8	21000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 29
> Selected Move:	5175	3	5	9	20500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 39
> Selected Move:	5211	3	2	5	22300


> New Y[]: 
	
	 2  3  0  1  0  4  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 26
> Selected Move:	5150	4	5	3	22500


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 35 #######################


> Neighbours evaluated; 27
> Selected Move:	5148	3	3	2	20500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 36 #######################


> Neighbours evaluated; 30
> Selected Move:	4790	3	9	7	20000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,375

## ITERATION 37 #######################


> Neighbours evaluated; 37
> Selected Move:	4960	3	2	3	22000


> New Y[]: 
	
	 2  3  0  4  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,38

## ITERATION 38 #######################


> Neighbours evaluated; 27
> Selected Move:	5026	4	3	5	21800


> New Y[]: 
	
	 2  3  0  1  0  4  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,385

## ITERATION 39 #######################


> Neighbours evaluated; 29
> Selected Move:	4820	3	5	2	20000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,39

## ITERATION 40 #######################


> Neighbours evaluated; 37
> Selected Move:	5105	3	7	4	21500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,395

## ITERATION 41 #######################


> Neighbours evaluated; 34
> Selected Move:	5090	4	1	3	17800


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 42 #######################


> Neighbours evaluated; 30
> Selected Move:	5090	4	3	4	16700


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 43 #######################


> Neighbours evaluated; 30
> Selected Move:	5090	4	4	6	18100


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 44 #######################


> Neighbours evaluated; 29
> Selected Move:	5090	4	6	8	19800


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 45 #######################


> Neighbours evaluated; 30
> Selected Move:	4780	3	8	1	17500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,4

## ITERATION 46 #######################


> Neighbours evaluated; 35
> Selected Move:	5090	3	2	8	19400


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  4  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 47 #######################


> Neighbours evaluated; 29
> Selected Move:	5090	4	8	3	17500


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 48 #######################


> Neighbours evaluated; 32
> Selected Move:	5090	4	3	4	16500


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 49 #######################


> Neighbours evaluated; 31
> Selected Move:	5090	4	4	6	18500


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 50 #######################


> Neighbours evaluated; 31
> Selected Move:	4770	3	3	5	18500


> New Y[]: 
	
	 2  3  0  0  1  1  4  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,375

## ITERATION 51 #######################


> Neighbours evaluated; 27
> Selected Move:	4770	4	6	4	16500


> New Y[]: 
	
	 2  3  0  0  4  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,37

## ITERATION 52 #######################


> Neighbours evaluated; 26
> Selected Move:	4925	1	-1	3	22500


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 53 #######################


> Neighbours evaluated; 26
> Selected Move:	4900	3	5	9	22000


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 54 #######################


> Neighbours evaluated; 29
> Selected Move:	4790	3	3	5	22000


> New Y[]: 
	
	 2  3  0  0  4  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 55 #######################


> Neighbours evaluated; 27
> Selected Move:	4550	2	5	-1	16000


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 56 #######################


> Neighbours evaluated; 30
> Selected Move:	4550	4	4	6	18000


> New Y[]: 
	
	 2  3  0  0  1  0  4  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 57 #######################


> Neighbours evaluated; 31
> Selected Move:	4550	4	6	8	18900


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  4  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 58 #######################


> Neighbours evaluated; 30
> Selected Move:	4770	3	9	5	19400


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  4  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,335

## ITERATION 59 #######################


> Neighbours evaluated; 24
> Selected Move:	4770	4	8	5	17300


> New Y[]: 
	
	 2  3  0  0  1  4  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,33

## ITERATION 60 #######################


> Neighbours evaluated; 27
> Selected Move:	4761	1	-1	3	23300


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,325

## ITERATION 61 #######################


> Neighbours evaluated; 23
> Selected Move:	4713	4	5	3	23500


> New Y[]: 
	
	 2  3  0  4  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,33

## ITERATION 62 #######################


> Neighbours evaluated; 23
> Selected Move:	4695	3	3	2	21500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 63 #######################


> Neighbours evaluated; 25
> Selected Move:	4815	3	5	9	21000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 64 #######################


> Neighbours evaluated; 32
> Selected Move:	4640	3	8	3	23000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 65 #######################


> Neighbours evaluated; 32
> Selected Move:	4790	2	4	-1	16500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 66 #######################


> Neighbours evaluated; 31
> Selected Move:	4820	3	9	8	15000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 67 #######################


> Neighbours evaluated; 29
> Selected Move:	4790	3	0	5	17500


> New Y[]: 
	
	 0  3  4  1  0  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 68 #######################


> Neighbours evaluated; 25
> Selected Move:	4790	4	5	3	17100


> New Y[]: 
	
	 0  3  4  2  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 69 #######################


> Neighbours evaluated; 25
> Selected Move:	4790	4	3	6	17600


> New Y[]: 
	
	 0  3  4  1  0  1  2  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 70 #######################


> Neighbours evaluated; 24
> Selected Move:	4790	4	6	8	18800


> New Y[]: 
	
	 0  3  4  1  0  1  1  0  2  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 71 #######################


> Neighbours evaluated; 26
> Selected Move:	4760	3	8	9	19500


> New Y[]: 
	
	 0  3  4  1  0  1  1  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 72 #######################


> Neighbours evaluated; 24
> Selected Move:	4760	4	9	3	18600


> New Y[]: 
	
	 0  3  4  2  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 73 #######################


> Neighbours evaluated; 25
> Selected Move:	4760	4	3	5	19000


> New Y[]: 
	
	 0  3  4  1  0  2  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 74 #######################


> Neighbours evaluated; 23
> Selected Move:	4760	4	5	6	19100


> New Y[]: 
	
	 0  3  4  1  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 75 #######################


> Neighbours evaluated; 26
> Selected Move:	4430	3	5	4	19600


> New Y[]: 
	
	 0  3  4  1  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 76 #######################


> Neighbours evaluated; 26
> Selected Move:	4610	3	9	8	18100


> New Y[]: 
	
	 0  3  4  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 77 #######################


> Neighbours evaluated; 28
> Selected Move:	4620	3	2	5	19900


> New Y[]: 
	
	 0  3  0  1  1  4  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,33

## ITERATION 78 #######################


> Neighbours evaluated; 11
> Selected Move:	4620	4	5	4	19100


> New Y[]: 
	
	 0  3  0  1  4  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,325

## ITERATION 79 #######################


> Neighbours evaluated; 11
> Selected Move:	4620	4	6	3	18600


> New Y[]: 
	
	 0  3  0  2  4  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 80 #######################


> Neighbours evaluated; 10
> Selected Move:	4620	4	3	4	19500


> New Y[]: 
	
	 0  3  0  4  2  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,315

## ITERATION 81 #######################


> Neighbours evaluated; 9
> Selected Move:	4620	4	3	5	19300


> New Y[]: 
	
	 0  3  0  1  2  4  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 82 #######################


> Neighbours evaluated; 10
> Selected Move:	4620	4	4	3	19400


> New Y[]: 
	
	 0  3  0  2  1  4  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 83 #######################


> Neighbours evaluated; 10
> Selected Move:	4620	4	3	5	20000


> New Y[]: 
	
	 0  3  0  4  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 84 #######################


> Neighbours evaluated; 9
> Selected Move:	4620	4	3	4	19000


> New Y[]: 
	
	 0  3  0  1  4  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 85 #######################


> Neighbours evaluated; 14
> Selected Move:	4532	4	5	8	20300


> New Y[]: 
	
	 0  3  0  1  4  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 86 #######################


> Neighbours evaluated; 12
> Selected Move:	4620	3	8	0	18500


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 87 #######################


> Neighbours evaluated; 25
> Selected Move:	4620	4	4	3	19500


> New Y[]: 
	
	 2  3  0  4  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 88 #######################


> Neighbours evaluated; 25
> Selected Move:	4620	4	3	5	19300


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 89 #######################


> Neighbours evaluated; 23
> Selected Move:	4620	3	6	8	18300


> New Y[]: 
	
	 2  3  0  1  1  4  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,27

## ITERATION 90 #######################


> Neighbours evaluated; 27
> Selected Move:	4680	3	4	9	17300


> New Y[]: 
	
	 2  3  0  1  0  4  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 91 #######################


> Neighbours evaluated; 29
> Selected Move:	4680	4	5	3	17500


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 92 #######################


> Neighbours evaluated; 29
> Selected Move:	4680	4	3	8	19400


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 93 #######################


> Neighbours evaluated; 27
> Selected Move:	4928	1	-1	6	24400


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 94 #######################


> Neighbours evaluated; 26
> Selected Move:	5250	4	8	9	23200


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,245

## ITERATION 95 #######################


> Neighbours evaluated; 25
> Selected Move:	5193	4	9	6	23500


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 96 #######################


> Neighbours evaluated; 26
> Selected Move:	4990	3	9	7	23000


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 97 #######################


> Neighbours evaluated; 28
> Selected Move:	5052	4	6	7	22800


> New Y[]: 
	
	 2  3  0  1  0  1  1  4  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 98 #######################


> Neighbours evaluated; 26
> Selected Move:	4774	4	7	8	23900


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  4  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 99 #######################


> Neighbours evaluated; 28
> Selected Move:	4740	3	8	2	22000


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 100 #######################


> Neighbours evaluated; 30
> Selected Move:	4700	3	2	9	24200


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 101 #######################


> Neighbours evaluated; 28
> Selected Move:	4909	4	9	5	23300


> New Y[]: 
	
	 2  3  0  1  0  4  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,26

## ITERATION 102 #######################


> Neighbours evaluated; 28
> Selected Move:	4840	4	5	3	23500


> New Y[]: 
	
	 2  3  0  4  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 103 #######################


> Neighbours evaluated; 27
> Selected Move:	4630	2	6	-1	18500


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 104 #######################


> Neighbours evaluated; 30
> Selected Move:	4670	3	3	6	18500


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 105 #######################


> Neighbours evaluated; 29
> Selected Move:	4670	4	6	5	17300


> New Y[]: 
	
	 2  3  0  0  0  4  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 106 #######################


> Neighbours evaluated; 29
> Selected Move:	4806	1	-1	8	21300


> New Y[]: 
	
	 2  3  0  0  0  4  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 107 #######################


> Neighbours evaluated; 28
> Selected Move:	4712	3	7	4	22800


> New Y[]: 
	
	 2  3  0  0  1  4  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 108 #######################


> Neighbours evaluated; 25
> Selected Move:	4760	3	5	3	23000


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 109 #######################


> Neighbours evaluated; 27
> Selected Move:	4539	4	3	9	23700


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 110 #######################


> Neighbours evaluated; 27
> Selected Move:	4550	2	3	-1	17700


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 111 #######################


> Neighbours evaluated; 28
> Selected Move:	4610	3	9	2	15500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 112 #######################


> Neighbours evaluated; 29
> Selected Move:	4790	3	4	5	15000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 113 #######################


> Neighbours evaluated; 27
> Selected Move:	4790	3	6	3	16000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 114 #######################


> Neighbours evaluated; 33
> Selected Move:	4880	1	-1	9	21500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 115 #######################


> Neighbours evaluated; 29
> Selected Move:	4855	3	1	6	23100


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,31

## ITERATION 116 #######################


> Neighbours evaluated; 29
> Selected Move:	4994	4	6	9	22600


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,315

## ITERATION 117 #######################


> Neighbours evaluated; 29
> Selected Move:	4960	3	9	4	22700


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 118 #######################


> Neighbours evaluated; 30
> Selected Move:	4926	3	5	9	22200


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 119 #######################


> Neighbours evaluated; 29
> Selected Move:	4825	3	4	5	23000


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,33

## ITERATION 120 #######################


> Neighbours evaluated; 26
> Selected Move:	4876	4	5	3	22800


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,335

## ITERATION 121 #######################


> Neighbours evaluated; 27
> Selected Move:	4537	3	9	4	23800


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 122 #######################


> Neighbours evaluated; 26
> Selected Move:	4730	2	6	-1	18800


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 123 #######################


> Neighbours evaluated; 30
> Selected Move:	4730	4	3	4	17700


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 124 #######################


> Neighbours evaluated; 30
> Selected Move:	4730	4	4	5	19000


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 125 #######################


> Neighbours evaluated; 30
> Selected Move:	4730	3	3	6	18000


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 126 #######################


> Neighbours evaluated; 31
> Selected Move:	4740	3	4	9	17000


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 127 #######################


> Neighbours evaluated; 31
> Selected Move:	4740	4	5	6	17100


> New Y[]: 
	
	 2  0  4  0  0  1  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 128 #######################


> Neighbours evaluated; 31
> Selected Move:	4740	4	6	8	18800


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 129 #######################


> Neighbours evaluated; 29
> Selected Move:	4740	4	8	9	16600


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 130 #######################


> Neighbours evaluated; 28
> Selected Move:	4730	3	9	4	16700


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 131 #######################


> Neighbours evaluated; 28
> Selected Move:	4730	4	4	6	18100


> New Y[]: 
	
	 2  0  4  0  1  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 132 #######################


> Neighbours evaluated; 29
> Selected Move:	4730	4	6	8	19800


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 133 #######################


> Neighbours evaluated; 29
> Selected Move:	4620	3	8	3	19800


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 134 #######################


> Neighbours evaluated; 26
> Selected Move:	4640	3	4	7	18300


> New Y[]: 
	
	 2  0  4  3  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 135 #######################


> Neighbours evaluated; 31
> Selected Move:	4640	4	3	5	18500


> New Y[]: 
	
	 2  0  4  1  0  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,32

## ITERATION 136 #######################


> Neighbours evaluated; 31
> Selected Move:	4640	4	5	6	18600


> New Y[]: 
	
	 2  0  4  1  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,315

## ITERATION 137 #######################


> Neighbours evaluated; 30
> Selected Move:	4640	4	6	7	18600


> New Y[]: 
	
	 2  0  4  1  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,31

## ITERATION 138 #######################


> Neighbours evaluated; 29
> Selected Move:	4620	3	7	4	18700


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 139 #######################


> Neighbours evaluated; 25
> Selected Move:	4620	4	4	5	20000


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 140 #######################


> Neighbours evaluated; 23
> Selected Move:	4610	1	-1	8	24000


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 141 #######################


> Neighbours evaluated; 23
> Selected Move:	4716	3	5	9	23100


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 142 #######################


> Neighbours evaluated; 28
> Selected Move:	4673	4	9	3	23300


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 143 #######################


> Neighbours evaluated; 26
> Selected Move:	4604	4	3	6	23600


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 144 #######################


> Neighbours evaluated; 28
> Selected Move:	4662	3	9	5	24100


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 145 #######################


> Neighbours evaluated; 23
> Selected Move:	4620	4	2	4	19100


> New Y[]: 
	
	 2  0  0  1  4  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 146 #######################


> Neighbours evaluated; 26
> Selected Move:	4620	4	4	5	19900


> New Y[]: 
	
	 2  0  0  1  1  4  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 147 #######################


> Neighbours evaluated; 24
> Selected Move:	4620	4	6	3	19600


> New Y[]: 
	
	 2  0  0  3  1  4  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 148 #######################


> Neighbours evaluated; 24
> Selected Move:	4620	4	3	4	18500


> New Y[]: 
	
	 2  0  0  1  3  4  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 149 #######################


> Neighbours evaluated; 23
> Selected Move:	4620	4	4	5	19000


> New Y[]: 
	
	 2  0  0  1  4  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 150 #######################


> Neighbours evaluated; 22
> Selected Move:	4620	4	4	3	20000


> New Y[]: 
	
	 2  0  0  4  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 151 #######################


> Neighbours evaluated; 22
> Selected Move:	4620	4	5	4	18700


> New Y[]: 
	
	 2  0  0  4  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 152 #######################


> Neighbours evaluated; 23
> Selected Move:	4620	4	3	4	18800


> New Y[]: 
	
	 2  0  0  3  4  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 153 #######################


> Neighbours evaluated; 20
> Selected Move:	4530	3	4	9	19500


> New Y[]: 
	
	 2  0  0  3  0  1  1  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 154 #######################


> Neighbours evaluated; 27
> Selected Move:	4530	4	3	5	19700


> New Y[]: 
	
	 2  0  0  1  0  3  1  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 155 #######################


> Neighbours evaluated; 27
> Selected Move:	4530	4	5	6	19800


> New Y[]: 
	
	 2  0  0  1  0  1  3  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,28

## ITERATION 156 #######################


> Neighbours evaluated; 26
> Selected Move:	4680	3	6	1	18200


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,275

## ITERATION 157 #######################


> Neighbours evaluated; 26
> Selected Move:	4630	3	8	7	19200


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 158 #######################


> Neighbours evaluated; 29
> Selected Move:	4670	3	3	6	18200


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 159 #######################


> Neighbours evaluated; 27
> Selected Move:	4630	3	9	8	17900


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  4  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,26

## ITERATION 160 #######################


> Neighbours evaluated; 29
> Selected Move:	4630	4	8	5	15800


> New Y[]: 
	
	 2  3  0  0  0  4  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 161 #######################


> Neighbours evaluated; 27
> Selected Move:	4630	4	5	6	17000


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 162 #######################


> Neighbours evaluated; 27
> Selected Move:	4630	4	6	7	16800


> New Y[]: 
	
	 2  3  0  0  0  1  1  4  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 163 #######################


> Neighbours evaluated; 25
> Selected Move:	4607	1	-1	9	22300


> New Y[]: 
	
	 2  3  0  0  0  1  1  4  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 164 #######################


> Neighbours evaluated; 26
> Selected Move:	4718	3	8	3	24300


> New Y[]: 
	
	 2  3  0  1  0  1  1  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 165 #######################


> Neighbours evaluated; 24
> Selected Move:	4693	4	7	6	24500


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 166 #######################


> Neighbours evaluated; 25
> Selected Move:	4595	3	3	8	22500


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 167 #######################


> Neighbours evaluated; 25
> Selected Move:	4675	4	6	9	22200


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 168 #######################


> Neighbours evaluated; 25
> Selected Move:	4685	3	9	4	21500


> New Y[]: 
	
	 2  3  0  0  4  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 169 #######################


> Neighbours evaluated; 28
> Selected Move:	4858	3	5	3	21500


> New Y[]: 
	
	 2  3  0  1  4  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 170 #######################


> Neighbours evaluated; 28
> Selected Move:	4610	4	4	3	22500


> New Y[]: 
	
	 2  3  0  4  1  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 171 #######################


> Neighbours evaluated; 29
> Selected Move:	4488	3	3	2	20500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 172 #######################


> Neighbours evaluated; 34
> Selected Move:	4455	3	2	5	22300


> New Y[]: 
	
	 2  3  0  0  1  4  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 173 #######################


> Neighbours evaluated; 25
> Selected Move:	4310	2	8	-1	18300


> New Y[]: 
	
	 2  3  0  0  1  4  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,26

## ITERATION 174 #######################


> Neighbours evaluated; 29
> Selected Move:	4430	3	5	3	18500


> New Y[]: 
	
	 2  3  0  4  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 175 #######################


> Neighbours evaluated; 29
> Selected Move:	4430	4	3	4	17500


> New Y[]: 
	
	 2  3  0  1  4  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 176 #######################


> Neighbours evaluated; 30
> Selected Move:	4445	1	-1	5	23500


> New Y[]: 
	
	 2  3  0  1  4  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 177 #######################


> Neighbours evaluated; 25
> Selected Move:	4400	3	7	9	24000


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 178 #######################


> Neighbours evaluated; 24
> Selected Move:	4630	3	6	8	23000


> New Y[]: 
	
	 2  3  0  1  4  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 179 #######################


> Neighbours evaluated; 27
> Selected Move:	4620	2	9	-1	17500


> New Y[]: 
	
	 2  3  0  1  4  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 180 #######################


> Neighbours evaluated; 22
> Selected Move:	4620	4	4	3	18500


> New Y[]: 
	
	 2  3  0  4  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 181 #######################


> Neighbours evaluated; 25
> Selected Move:	4591	3	0	6	20100


> New Y[]: 
	
	 0  3  0  4  1  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 182 #######################


> Neighbours evaluated; 9
> Selected Move:	4530	3	4	9	19100


> New Y[]: 
	
	 0  3  0  4  0  1  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 183 #######################


> Neighbours evaluated; 24
> Selected Move:	4530	4	3	5	18900


> New Y[]: 
	
	 0  3  0  1  0  4  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 184 #######################


> Neighbours evaluated; 22
> Selected Move:	4530	4	5	6	20000


> New Y[]: 
	
	 0  3  0  1  0  2  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 185 #######################


> Neighbours evaluated; 22
> Selected Move:	4530	4	5	3	19600


> New Y[]: 
	
	 0  3  0  2  0  1  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,28

## ITERATION 186 #######################


> Neighbours evaluated; 21
> Selected Move:	4530	4	6	5	18400


> New Y[]: 
	
	 0  3  0  2  0  4  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,275

## ITERATION 187 #######################


> Neighbours evaluated; 22
> Selected Move:	4530	4	3	5	19000


> New Y[]: 
	
	 0  3  0  4  0  2  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,27

## ITERATION 188 #######################


> Neighbours evaluated; 19
> Selected Move:	4530	4	3	9	19700


> New Y[]: 
	
	 0  3  0  1  0  2  1  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 189 #######################


> Neighbours evaluated; 20
> Selected Move:	4530	4	5	3	19300


> New Y[]: 
	
	 0  3  0  2  0  1  1  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 190 #######################


> Neighbours evaluated; 19
> Selected Move:	4530	4	3	6	19800


> New Y[]: 
	
	 0  3  0  1  0  1  2  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 191 #######################


> Neighbours evaluated; 20
> Selected Move:	4403	4	6	9	20500


> New Y[]: 
	
	 0  3  0  1  0  1  4  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 192 #######################


> Neighbours evaluated; 19
> Selected Move:	4530	4	6	3	19500


> New Y[]: 
	
	 0  3  0  4  0  1  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,245

## ITERATION 193 #######################


> Neighbours evaluated; 18
> Selected Move:	4530	4	3	5	19300


> New Y[]: 
	
	 0  3  0  1  0  4  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 194 #######################


> Neighbours evaluated; 17
> Selected Move:	4506	4	9	8	20100


> New Y[]: 
	
	 0  3  0  1  0  4  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 195 #######################


> Neighbours evaluated; 20
> Selected Move:	4460	4	5	3	20300


> New Y[]: 
	
	 0  3  0  4  0  1  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 196 #######################


> Neighbours evaluated; 19
> Selected Move:	4415	4	3	8	20500


> New Y[]: 
	
	 0  3  0  2  0  1  1  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 197 #######################


> Neighbours evaluated; 18
> Selected Move:	4328	4	3	5	20900


> New Y[]: 
	
	 0  3  0  1  0  2  1  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 198 #######################


> Neighbours evaluated; 16
> Selected Move:	4530	3	5	0	18400


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  4  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 199 #######################


> Neighbours evaluated; 26
> Selected Move:	4530	4	8	3	16500


> New Y[]: 
	
	 2  3  0  4  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 200 #######################


> Neighbours evaluated; 25
> Selected Move:	4530	4	3	6	17500


> New Y[]: 
	
	 2  3  0  1  0  0  4  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 201 #######################


> Neighbours evaluated; 25
> Selected Move:	4650	1	-1	4	24000


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 202 #######################


> Neighbours evaluated; 26
> Selected Move:	4725	3	9	5	24500


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 203 #######################


> Neighbours evaluated; 21
> Selected Move:	4620	4	1	4	19700


> New Y[]: 
	
	 2  0  0  1  3  1  4  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,26
________________________________________________________________

Best solution found: 5590
Run Termination time: 31.01.2010 10:26:50
Run duration: 00:00:56.3125000
________________________________________________________________
